منابع مشابه
Digit-set Conversions: Generalizations and Applications
The problem of digit set conversion for xed radix is investigated for the case of converting into a non-redundant, as well as into a redundant digit set. Conversion may be from very general digit sets, and covers as special cases multiplier recodings, additions and certain multiplications. We generalize known algorithms for conversions into non-redundant digit sets, as well as apply conversion ...
متن کاملUnbalanced digit sets and the closest choice strategy for minimal weight integer representations
An online algorithm is presented that produces an optimal radix-2 representation of an input integer n using digits from the set D`,u = {a ∈ Z : ` ≤ a ≤ u}, where ` ≤ 0 and u ≥ 1. The algorithm works by scanning the digits of the binary representation of n from left-to-right (i.e., from most-significant to least-significant). The output representation is optimal in the sense that, of all radix-...
متن کاملDigit Set Randomization in Elliptic Curve Cryptography
We introduce a new approach for randomizing the digit sets of binary integer representations used in elliptic curve cryptography, and present a formal analysis of the sparsity of such representations. The motivation is to improve the sparseness of integer representations and to provide a tool for defense against side channel attacks. Existing alternative digit sets D such as D = {0, 1,−1} requi...
متن کاملMinimal Dominating Set Enumeration
Let G be a graph on n vertices and m edges. An edge is written xy (equivalently yx). A dominating set in G is a set of vertices D such that every vertex of G is either in D or is adjacent to some vertex of D. It is said to be minimal if it does not contain any other dominating set as a proper subset. For every vertex x let N [x] be {x} ∪ {y | xy ∈ E}, and for every S ⊆ V let N [S] := ⋃ x∈S N [x...
متن کاملMinimal weight and colexicographically minimal integer representations
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently implement algebraic operations required by public-key cryptosystems, especially those based on elliptic curves. Several families of integer representations have been proposed that have a minimal number of nonzero digits (so-called minimal weight representations). We observe that many of the construc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2004
ISSN: 0018-9340
DOI: 10.1109/tc.2004.14